Fast relative Lempel–Ziv self-index for similar sequences
نویسندگان
چکیده
منابع مشابه
Fast Relative Lempel-Ziv Self-index for Similar Sequences
Recent advances in biotechnology and web technology are generating huge collections of similar strings. People now face the problem of storing them compactly while supporting fast pattern searching. One compression scheme called relative Lempel-Ziv compression uses textual substitutions from a reference text as follows: Given a (large) set S of strings, represent each string in S as a concatena...
متن کاملFast Recognition of Self - Similar Landmarks
Mobile robot localization and navigation require robust and eecient methods for utilizing perceptual information. In this paper we propose a design for simple visual landmarks that can be unobtrusively added to an environment for navigation without a global geometric map of the workspace. We describe self-similar intensity patterns together with an eecient and reliable algorithm for their detec...
متن کاملFast Approximation of Self-Similar Network Traffic
Recent network traffic studies argue that network arrival processes are much more faithfully modeled using statistically self-similarprocesses instead of traditional Poisson processes [LTWW94a, PF94]. One difficulty in dealing with selfsimilar models is how to efficiently synthesize traces (sample paths) corresponding to self-similar traffic. We present a fast Fourier transform method for synth...
متن کاملHurst Index Estimation for Self-similar processes with Long-Memory
The statistical estimation of the Hurst index is one of the fundamental problems in the literature of long-range dependent and self-similar processes. In this article, the Hurst index estimation problem is addressed for a special class of self-similar processes that exhibit long-memory, the Hermite processes. These processes generalize the fractional Brownian motion, in the sense that they shar...
متن کاملFast Discovery of Similar Sequences in Large Genomic Collections
Detection of highly similar sequences within genomic collections has a number of applications, including the assembly of expressed sequence tag data, genome comparison, and clustering sequence collections for improved search speed and accuracy. While several approaches exist for this task, they are becoming infeasible — either in space or in time — as genomic collections continue to grow at a r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.07.024